
<!DOCTYPE HTML>
<html lang="" >
    <head>
        <meta charset="UTF-8">
        <meta content="text/html; charset=utf-8" http-equiv="Content-Type">
        <title>树和森林 · GitBook</title>
        <meta http-equiv="X-UA-Compatible" content="IE=edge" />
        <meta name="description" content="">
        <meta name="generator" content="GitBook 3.2.3">
        
        
        
    
    <link rel="stylesheet" href="../gitbook/style.css">

    
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-highlight/website.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-search/search.css">
                
            
                
                <link rel="stylesheet" href="../gitbook/gitbook-plugin-fontsettings/website.css">
                
            
        

    

    
        
    
        
    
        
    
        
    
        
    
        
    

        
    
    
    <meta name="HandheldFriendly" content="true"/>
    <meta name="viewport" content="width=device-width, initial-scale=1, user-scalable=no">
    <meta name="apple-mobile-web-app-capable" content="yes">
    <meta name="apple-mobile-web-app-status-bar-style" content="black">
    <link rel="apple-touch-icon-precomposed" sizes="152x152" href="../gitbook/images/apple-touch-icon-precomposed-152.png">
    <link rel="shortcut icon" href="../gitbook/images/favicon.ico" type="image/x-icon">

    
    <link rel="next" href="赫夫曼树.html" />
    
    
    <link rel="prev" href="遍历二叉树和线索二叉树.html" />
    

    </head>
    <body>
        
<div class="book">
    <div class="book-summary">
        
            
<div id="book-search-input" role="search">
    <input type="text" placeholder="Type to search" />
</div>

            
                <nav role="navigation">
                


<ul class="summary">
    
    

    

    
        
        
    
        <li class="chapter " data-level="1.1" data-path="../">
            
                <a href="../">
            
                    
                    数据结构（C语言版） 复习总结
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.2" data-path="../chapter1.html">
            
                <a href="../chapter1.html">
            
                    
                    第一章 绪论
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.3" data-path="../chapter2/chapter2.html">
            
                <a href="../chapter2/chapter2.html">
            
                    
                    第二章 线性表
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.3.1" data-path="../chapter2/顺序表.html">
            
                <a href="../chapter2/顺序表.html">
            
                    
                    线性表的顺序表示和实现
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.3.2" data-path="../chapter2/链表.html">
            
                <a href="../chapter2/链表.html">
            
                    
                    线性表的链式表示和实现
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.4" data-path="../chapter3/chapter3.html">
            
                <a href="../chapter3/chapter3.html">
            
                    
                    第三章 栈和队列
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.4.1" data-path="../chapter3/栈.html">
            
                <a href="../chapter3/栈.html">
            
                    
                    抽象数据类型栈的定义和实现
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.4.2" data-path="../chapter3/队列.html">
            
                <a href="../chapter3/队列.html">
            
                    
                    抽象数据类型队列的定义和实现
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.5" >
            
                <span>
            
                    
                    第四章 串
            
                </span>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.5.1" data-path="../chapter4/串类型.html">
            
                <a href="../chapter4/串类型.html">
            
                    
                    串类型的定义
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.5.2" data-path="../chapter4/串的表示和实现.html">
            
                <a href="../chapter4/串的表示和实现.html">
            
                    
                    串的表示和实现
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.5.3" data-path="../chapter4/串的模式匹配算法.html">
            
                <a href="../chapter4/串的模式匹配算法.html">
            
                    
                    串的模式匹配算法
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.6" >
            
                <span>
            
                    
                    第五章 数组和广义表
            
                </span>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.6.1" data-path="../chapter5/数组的定义.html">
            
                <a href="../chapter5/数组的定义.html">
            
                    
                    数组的定义
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.6.2" data-path="../chapter5/矩阵的压缩存储.html">
            
                <a href="../chapter5/矩阵的压缩存储.html">
            
                    
                    矩阵的压缩存储
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.6.3" data-path="../chapter5/广义表.html">
            
                <a href="../chapter5/广义表.html">
            
                    
                    广义表
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.7" >
            
                <span>
            
                    
                    第六章 树和二叉树
            
                </span>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.7.1" data-path="树.html">
            
                <a href="树.html">
            
                    
                    树的定义与基本术语
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.7.2" data-path="二叉树.html">
            
                <a href="二叉树.html">
            
                    
                    二叉树
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.7.2.1" data-path="二叉树的二叉链表实现.html">
            
                <a href="二叉树的二叉链表实现.html">
            
                    
                    二叉树的二叉链表实现
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.7.3" data-path="遍历二叉树和线索二叉树.html">
            
                <a href="遍历二叉树和线索二叉树.html">
            
                    
                    遍历二叉树和线索二叉树
            
                </a>
            

            
        </li>
    
        <li class="chapter active" data-level="1.7.4" data-path="树和森林.html">
            
                <a href="树和森林.html">
            
                    
                    树和森林
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.7.5" data-path="赫夫曼树.html">
            
                <a href="赫夫曼树.html">
            
                    
                    赫夫曼树
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.8" >
            
                <span>
            
                    
                    第七章 图
            
                </span>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.8.1" data-path="../chapter7/图.html">
            
                <a href="../chapter7/图.html">
            
                    
                    图的定义
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.8.2" data-path="../chapter7/图的存储结构.html">
            
                <a href="../chapter7/图的存储结构.html">
            
                    
                    图的存储结构
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.8.3" data-path="../chapter7/图的遍历.html">
            
                <a href="../chapter7/图的遍历.html">
            
                    
                    图的遍历
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.8.4" data-path="../chapter7/最小生成树.html">
            
                <a href="../chapter7/最小生成树.html">
            
                    
                    最小生成树
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.8.5" data-path="../chapter7/有向无环图.html">
            
                <a href="../chapter7/有向无环图.html">
            
                    
                    有向无环图的应用
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.9" data-path="../chapter8/查找.html">
            
                <a href="../chapter8/查找.html">
            
                    
                    第八章 查找
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.9.1" data-path="../chapter8/静态查找表.html">
            
                <a href="../chapter8/静态查找表.html">
            
                    
                    静态查找表
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.9.2" data-path="../chapter8/动态查找表.html">
            
                <a href="../chapter8/动态查找表.html">
            
                    
                    动态查找表
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.9.3" data-path="../chapter8/哈希表.html">
            
                <a href="../chapter8/哈希表.html">
            
                    
                    哈希表
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    
        <li class="chapter " data-level="1.10" data-path="../chapter9/内部排序.html">
            
                <a href="../chapter9/内部排序.html">
            
                    
                    第九章 内部排序
            
                </a>
            

            
            <ul class="articles">
                
    
        <li class="chapter " data-level="1.10.1" data-path="../chapter9/插入排序.html">
            
                <a href="../chapter9/插入排序.html">
            
                    
                    插入排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.10.2" data-path="../chapter9/选择排序.html">
            
                <a href="../chapter9/选择排序.html">
            
                    
                    选择排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.10.3" data-path="../chapter9/快速排序.html">
            
                <a href="../chapter9/快速排序.html">
            
                    
                    快速排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.10.4" data-path="../chapter9/归并排序和基数排序.html">
            
                <a href="../chapter9/归并排序和基数排序.html">
            
                    
                    归并排序和基数排序
            
                </a>
            

            
        </li>
    
        <li class="chapter " data-level="1.10.5" data-path="../chapter9/排序方法的比较.html">
            
                <a href="../chapter9/排序方法的比较.html">
            
                    
                    排序方法的比较
            
                </a>
            

            
        </li>
    

            </ul>
            
        </li>
    

    

    <li class="divider"></li>

    <li>
        <a href="https://www.gitbook.com" target="blank" class="gitbook-link">
            Published with GitBook
        </a>
    </li>
</ul>


                </nav>
            
        
    </div>

    <div class="book-body">
        
            <div class="body-inner">
                
                    

<div class="book-header" role="navigation">
    

    <!-- Title -->
    <h1>
        <i class="fa fa-circle-o-notch fa-spin"></i>
        <a href=".." >树和森林</a>
    </h1>
</div>




                    <div class="page-wrapper" tabindex="-1" role="main">
                        <div class="page-inner">
                            
<div id="book-search-results">
    <div class="search-noresults">
    
                                <section class="normal markdown-section">
                                
                                <h2 id="&#x6811;&#x548C;&#x68EE;&#x6797;">&#x6811;&#x548C;&#x68EE;&#x6797;</h2>
<h3 id="&#x6811;&#x7684;&#x5B58;&#x50A8;&#x7ED3;&#x6784;">&#x6811;&#x7684;&#x5B58;&#x50A8;&#x7ED3;&#x6784;</h3>
<p>&#x8FD9;&#x91CC;&#x4ECB;&#x7ECD;&#x4E09;&#x79CD;&#x5E38;&#x7528;&#x7684;&#x94FE;&#x8868;&#x7ED3;&#x6784;&#x6765;&#x8868;&#x793A;&#x6811;&#x3002;</p>
<p><strong>1. &#x53CC;&#x4EB2;&#x8868;&#x793A;&#x6CD5;</strong></p>
<p>&#x4EE5;&#x4E00;&#x7EC4;&#x8FDE;&#x7EED;&#x7A7A;&#x95F4;&#x5B58;&#x50A8;&#x6811;&#x7684;&#x7ED3;&#x70B9;&#xFF0C;&#x540C;&#x65F6;&#x5728;&#x6BCF;&#x4E2A;&#x7ED3;&#x70B9;&#x4E2D;&#x9644;&#x8BBE;&#x4E00;&#x4E2A;&#x6307;&#x793A;&#x5668;&#x6307;&#x793A;&#x5176;&#x53CC;&#x4EB2;&#x7ED3;&#x70B9;&#x5728;&#x94FE;&#x8868;&#x4E2D;&#x7684;&#x4F4D;&#x7F6E;&#x3002;</p>
<pre><code class="lang-C"><span class="hljs-meta">#<span class="hljs-meta-keyword">define</span> MAX_TREE_SIZE 100 <span class="hljs-comment">// &#x6700;&#x5927;&#x7ED3;&#x70B9;&#x6570;</span></span>

<span class="hljs-comment">/**
 * &#x6811;&#x7684;&#x6570;&#x636E;&#x5143;&#x7D20;&#x7ED3;&#x70B9;&#x7ED3;&#x6784;
 */</span>
<span class="hljs-keyword">typedef</span> <span class="hljs-keyword">struct</span> PTNode
{
    ElemType data;
    <span class="hljs-keyword">int</span> parent; <span class="hljs-comment">// &#x53CC;&#x4EB2;&#x4F4D;&#x7F6E;&#x57DF;&#xFF0C;&#x6839;&#x8282;&#x70B9;&#x7684;&#x8BE5;&#x57DF;&#x7F6E;&#x4E3A; -1</span>
}PTNode;

<span class="hljs-comment">/**
 * &#x6811;&#x7684;&#x53CC;&#x4EB2;&#x5B58;&#x50A8;&#x8868;&#x793A;
 */</span>
<span class="hljs-keyword">typedef</span> <span class="hljs-keyword">struct</span>
{
    PTNode nodes[MAX_TREE_SIZE];
    <span class="hljs-keyword">int</span> r, n; <span class="hljs-comment">// &#x6839;&#x7684;&#x4F4D;&#x7F6E;&#x4E8E;&#x7ED3;&#x70B9;&#x6570;</span>
}PTree;
</code></pre>
<blockquote>
<p>&#x7279;&#x70B9;&#xFF1A;&#x627E;&#x53CC;&#x4EB2;&#x5BB9;&#x6613;&#xFF0C;&#x627E;&#x5B69;&#x5B50;&#x96BE;</p>
</blockquote>
<p><strong>2. &#x5B69;&#x5B50;&#x8868;&#x793A;&#x6CD5;</strong></p>
<p>&#x628A;&#x6BCF;&#x4E2A;&#x7ED3;&#x70B9;&#x7684;&#x5B69;&#x5B50;&#x7ED3;&#x70B9;&#x6392;&#x5217;&#x8D77;&#x6765;&#xFF0C;&#x770B;&#x6210;&#x662F;&#x4E00;&#x4E2A;&#x7EBF;&#x6027;&#x8868;&#xFF0C;&#x4E14;&#x4EE5;&#x5355;&#x94FE;&#x8868;&#x505A;&#x5B58;&#x50A8;&#x7ED3;&#x6784;&#xFF0C;&#x5219; n &#x4E2A;&#x7ED3;&#x70B9;&#x6709; n &#x4E2A;&#x5B69;&#x5B50;&#x94FE;&#x8868;&#xFF08;&#x53F6;&#x5B50;&#x7684;&#x5B69;&#x5B50;&#x94FE;&#x8868;&#x4E3A;&#x7A7A;&#xFF09;&#x3002;&#x800C; n &#x4E2A;&#x5934;&#x6307;&#x9488;&#x53C8;&#x7EC4;&#x6210;&#x4E00;&#x4E2A;&#x7EBF;&#x6027;&#x8868;&#xFF0C;&#x4E3A;&#x4E86;&#x4FBF;&#x4E8E;&#x67E5;&#x627E;&#xFF0C;&#x53EF;&#x91C7;&#x7528;&#x987A;&#x5E8F;&#x5B58;&#x50A8;&#x7ED3;&#x6784;&#x3002;</p>
<pre><code class="lang-C"><span class="hljs-comment">/**
 * &#x5B69;&#x5B50;&#x7ED3;&#x70B9;
 */</span>
<span class="hljs-keyword">typedef</span> <span class="hljs-keyword">struct</span> CTNode
{
    <span class="hljs-keyword">int</span> child;
    <span class="hljs-keyword">struct</span> CTNode *next;
}*ChildPtr;

<span class="hljs-keyword">typedef</span> <span class="hljs-keyword">struct</span>
{
    ElemType data; <span class="hljs-comment">// &#x7ED3;&#x70B9;&#x7684;&#x6570;&#x636E;&#x5143;&#x7D20;</span>
    ChildPtr firstchild; <span class="hljs-comment">// &#x5B69;&#x5B50;&#x94FE;&#x8868;&#x5934;&#x6307;&#x9488;</span>
<span class="hljs-comment">//  int parent; // &#x589E;&#x8BBE; parent &#x57DF;&#xFF0C;&#x6307;&#x793A;&#x53CC;&#x4EB2;&#x4F4D;&#x7F6E;</span>
}CTBox;

<span class="hljs-keyword">typedef</span> <span class="hljs-keyword">struct</span>
{
    CTBox nodes[MAX_TREE_SIZE];
    <span class="hljs-keyword">int</span> n, r; <span class="hljs-comment">// &#x7ED3;&#x70B9;&#x6570;&#x548C;&#x6839;&#x7ED3;&#x70B9;&#x7684;&#x4F4D;&#x7F6E;</span>
}CTree;
</code></pre>
<p><strong>3. &#x5B69;&#x5B50;&#x5144;&#x5F1F;&#x8868;&#x793A;&#x6CD5;</strong></p>
<p>&#x8BE5;&#x8868;&#x793A;&#x6CD5;&#x4EE5;&#x4E8C;&#x53C9;&#x94FE;&#x8868;&#x4F5C;&#x4E3A;&#x6811;&#x7684;&#x5B58;&#x50A8;&#x7ED3;&#x6784;&#xFF0C;&#x94FE;&#x8868;&#x4E2D;&#x7ED3;&#x70B9;&#x7684;&#x4E24;&#x4E2A;&#x94FE;&#x57DF;&#x5206;&#x522B;&#x6307;&#x5411;&#x8BE5;&#x7ED3;&#x70B9;&#x7684;&#x7B2C;&#x4E00;&#x4E2A;&#x5B69;&#x5B50;&#x7ED3;&#x70B9;&#x548C;&#x4E0B;&#x4E00;&#x4E2A;&#x5144;&#x5F1F;&#x7ED3;&#x70B9;&#x3002;</p>
<pre><code class="lang-C"><span class="hljs-keyword">typedef</span> <span class="hljs-keyword">struct</span> CSNode
{
    ElemType data;
    <span class="hljs-keyword">struct</span> CSNode *firstchild, *nextsibling;
}CSNode, *CSTree;
</code></pre>
<blockquote>
<p>&#x64CD;&#x4F5C;&#x5BB9;&#x6613;&#xFF0C;&#x4F46;&#x662F;&#x7834;&#x574F;&#x4E86;&#x6811;&#x7684;&#x5C42;&#x6B21;&#x3002;</p>
</blockquote>
<h3 id="&#x68EE;&#x6797;&#x8F6C;&#x6362;&#x4E3A;&#x4E8C;&#x53C9;&#x6811;">&#x68EE;&#x6797;&#x8F6C;&#x6362;&#x4E3A;&#x4E8C;&#x53C9;&#x6811;</h3>
<p>&#x5728;&#x6811;&#x4E2D;&#xFF0C;&#x67D0;&#x7ED3;&#x70B9;&#x7684;&#x5144;&#x5F1F;&#x7ED3;&#x70B9;&#x53D8;&#x4E3A;&#x8BE5;&#x7ED3;&#x70B9;&#x7684;&#x53F3;&#x5B50;&#x7ED3;&#x70B9;&#xFF0C;&#x67D0;&#x7ED3;&#x70B9;&#x7684;&#x7B2C;&#x4E00;&#x4E2A;&#x5B69;&#x5B50;&#x7ED3;&#x70B9;&#x53D8;&#x4E3A;&#x8BE5;&#x7ED3;&#x70B9;&#x7684;&#x5DE6;&#x5B50;&#x7ED3;&#x70B9;&#x3002;&#x68EE;&#x6797;&#x4E2D;&#x7684;&#x7B2C;&#x4E8C;&#x68F5;&#x6811;&#x7684;&#x6839;&#x7ED3;&#x70B9;&#x53D8;&#x4E3A;&#x7B2C;&#x4E00;&#x68F5;&#x6811;&#x7684;&#x6839;&#x7ED3;&#x70B9;&#x7684;&#x53F3;&#x5B50;&#x7ED3;&#x70B9;&#xFF0C;&#x4F9D;&#x6B21;&#x7C7B;&#x63A8;&#x3002;</p>
<blockquote>
<p>&#x4E8C;&#x53C9;&#x6811;&#x8F6C;&#x6362;&#x4E3A;&#x68EE;&#x6797;&#x7684;&#x8FC7;&#x7A0B;&#x4E0E;&#x4E4B;&#x76F8;&#x53CD;&#x3002;</p>
</blockquote>
<h3 id="&#x6811;&#x548C;&#x68EE;&#x6797;&#x7684;&#x904D;&#x5386;">&#x6811;&#x548C;&#x68EE;&#x6797;&#x7684;&#x904D;&#x5386;</h3>
<p>&#x5BF9;&#x4E8E;&#x6811;&#x7684;&#x904D;&#x5386;&#x6709;&#x4E24;&#x79CD;&#x65B9;&#x6CD5;&#xFF1A;</p>
<ul>
<li>&#x5148;&#x5E8F;&#x904D;&#x5386;&#xFF1A;&#x5148;&#x8BBF;&#x95EE;&#x6811;&#x7684;&#x6839;&#x7ED3;&#x70B9;&#xFF0C;&#x7136;&#x540E;&#x4F9D;&#x6B21;&#x904D;&#x5386;&#x6839;&#x7684;&#x6BCF;&#x4E00;&#x68F5;&#x5B50;&#x6811;&#x3002;</li>
<li>&#x540E;&#x5E8F;&#x904D;&#x5386;&#xFF1A;&#x5148;&#x4F9D;&#x6B21;&#x904D;&#x5386;&#x6BCF;&#x68F5;&#x5B50;&#x6811;&#xFF0C;&#x7136;&#x540E;&#x8BBF;&#x95EE;&#x6839;&#x7ED3;&#x70B9;&#x3002;</li>
</ul>
<p>&#x5BF9;&#x4E8E;&#x68EE;&#x6797;&#x7684;&#x4E24;&#x79CD;&#x904D;&#x5386;&#x65B9;&#x6CD5;&#xFF1A;</p>
<ul>
<li>&#x5148;&#x5E8F;&#x904D;&#x5386;&#x68EE;&#x6797;&#xFF1A;</li>
<li>&#x8BBF;&#x95EE;&#x68EE;&#x6797;&#x4E2D;&#x7B2C;&#x4E00;&#x68F5;&#x6811;&#x7684;&#x6839;&#x8282;&#x70B9;&#xFF1B;</li>
<li>&#x5148;&#x5E8F;&#x904D;&#x5386;&#x7B2C;&#x4E00;&#x68F5;&#x6811;&#x4E2D;&#x6839;&#x7ED3;&#x70B9;&#x7684;&#x5B50;&#x6811;&#xFF1B;</li>
<li><p>&#x5148;&#x5E8F;&#x904D;&#x5386;&#x4E4B;&#x540E;&#x5269;&#x4F59;&#x7684;&#x6811;&#x6784;&#x6210;&#x7684;&#x68EE;&#x6797;&#x3002;</p>
</li>
<li><p>&#x4E2D;&#x5E8F;&#x904D;&#x5386;&#x68EE;&#x6797;&#xFF1A;</p>
</li>
<li>&#x4E2D;&#x5E8F;&#x904D;&#x5386;&#x7B2C;&#x4E00;&#x68F5;&#x6811;&#x4E2D;&#x6839;&#x7ED3;&#x70B9;&#x7684;&#x5B50;&#x6811;&#xFF1B;</li>
<li>&#x8BBF;&#x95EE;&#x68EE;&#x6797;&#x4E2D;&#x7B2C;&#x4E00;&#x68F5;&#x6811;&#x7684;&#x6839;&#x8282;&#x70B9;&#xFF1B;</li>
<li>&#x4E2D;&#x5E8F;&#x904D;&#x5386;&#x4E4B;&#x540E;&#x5269;&#x4F59;&#x7684;&#x6811;&#x6784;&#x6210;&#x7684;&#x68EE;&#x6797;&#x3002;</li>
</ul>

                                
                                </section>
                            
    </div>
    <div class="search-results">
        <div class="has-results">
            
            <h1 class="search-results-title"><span class='search-results-count'></span> results matching "<span class='search-query'></span>"</h1>
            <ul class="search-results-list"></ul>
            
        </div>
        <div class="no-results">
            
            <h1 class="search-results-title">No results matching "<span class='search-query'></span>"</h1>
            
        </div>
    </div>
</div>

                        </div>
                    </div>
                
            </div>

            
                
                <a href="遍历二叉树和线索二叉树.html" class="navigation navigation-prev " aria-label="Previous page: 遍历二叉树和线索二叉树">
                    <i class="fa fa-angle-left"></i>
                </a>
                
                
                <a href="赫夫曼树.html" class="navigation navigation-next " aria-label="Next page: 赫夫曼树">
                    <i class="fa fa-angle-right"></i>
                </a>
                
            
        
    </div>

    <script>
        var gitbook = gitbook || [];
        gitbook.push(function() {
            gitbook.page.hasChanged({"page":{"title":"树和森林","level":"1.7.4","depth":2,"next":{"title":"赫夫曼树","level":"1.7.5","depth":2,"path":"chapter6/赫夫曼树.md","ref":"chapter6/赫夫曼树.md","articles":[]},"previous":{"title":"遍历二叉树和线索二叉树","level":"1.7.3","depth":2,"path":"chapter6/遍历二叉树和线索二叉树.md","ref":"chapter6/遍历二叉树和线索二叉树.md","articles":[]},"dir":"ltr"},"config":{"gitbook":"*","theme":"default","variables":{},"plugins":[],"pluginsConfig":{"highlight":{},"search":{},"lunr":{"maxIndexSize":1000000,"ignoreSpecialCharacters":false},"sharing":{"facebook":true,"twitter":true,"google":false,"weibo":false,"instapaper":false,"vk":false,"all":["facebook","google","twitter","weibo","instapaper"]},"fontsettings":{"theme":"white","family":"sans","size":2},"theme-default":{"styles":{"website":"styles/website.css","pdf":"styles/pdf.css","epub":"styles/epub.css","mobi":"styles/mobi.css","ebook":"styles/ebook.css","print":"styles/print.css"},"showLevel":false}},"structure":{"langs":"LANGS.md","readme":"README.md","glossary":"GLOSSARY.md","summary":"SUMMARY.md"},"pdf":{"pageNumbers":true,"fontSize":12,"fontFamily":"Arial","paperSize":"a4","chapterMark":"pagebreak","pageBreaksBefore":"/","margin":{"right":62,"left":62,"top":56,"bottom":56}},"styles":{"website":"styles/website.css","pdf":"styles/pdf.css","epub":"styles/epub.css","mobi":"styles/mobi.css","ebook":"styles/ebook.css","print":"styles/print.css"}},"file":{"path":"chapter6/树和森林.md","mtime":"2018-08-23T02:52:02.739Z","type":"markdown"},"gitbook":{"version":"3.2.3","time":"2018-09-02T10:05:33.540Z"},"basePath":"..","book":{"language":""}});
        });
    </script>
</div>

        
    <script src="../gitbook/gitbook.js"></script>
    <script src="../gitbook/theme.js"></script>
    
        
        <script src="../gitbook/gitbook-plugin-search/search-engine.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-search/search.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-lunr/lunr.min.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-lunr/search-lunr.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-sharing/buttons.js"></script>
        
    
        
        <script src="../gitbook/gitbook-plugin-fontsettings/fontsettings.js"></script>
        
    

    </body>
</html>

